منابع مشابه
Parallel versions of the symbolic manipulation system FORM
The symbolic manipulation program FORM is specialized to handle very large algebraic expressions. Some specific features of its internal structure make FORM very well suited for parallelization. We have now two parallel versions of FORM, one is based on POSIX threads and is optimal for modern multicore computers while another one uses MPI and can be used to parallelize FORM on clusters and Mass...
متن کاملA comparison of data - parallel and message - passing versions ofthe
A two-pronged eeort to convert a recently developed ocean circulation model written in Fortran-77 for execution on massively parallel computers is described. A data-parallel version has been developed for the CM-5 manufactured by Thinking Machines, Inc., while a message-passing version has been developed for the Cray T3D. Since the time diierentiation scheme in the ocean model is fully explicit...
متن کاملBlock and Parallel Versions of One-Sided Bidiagonalization
Two new algorithms for one-sided bidiagonalization are presented. The first is a block version which improves execution time by improving cache utilization from the use of BLAS 2.5 operations and more BLAS 3 operations. The second is adapted to parallel computation. When incorporated into singular value decomposition software, the second algorithm is faster than the corresponding ScaLAPACK rout...
متن کاملParallel and Anti-parallel Spins: More Differences
We show that a set of linearly independent parallel states {|−→ ni ,−→ ni 〉} can always be exactly transformed into the corresponding anti-parallel states {|−→ ni ,−−→ ni 〉} with certainty. But this is not true, in general, for a set of linearly independent anti-parallel states. Moreover, we show that for a set of linearly independent anti-parallel states one can exactly but probabilistically t...
متن کاملComputing More Specific Versions of Conditional Rewriting Systems
Rewrite systems obtained by some automated transformation often have a poor syntactic structure even if they have good properties from a semantic point of view. For instance, a rewrite system might have overlapping left-hand sides even if it can only produce at most one constructor normal form (i.e., value). In this paper, we propose a method for computing “more specific” versions of determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear and Particle Physics Proceedings
سال: 2015
ISSN: 2405-6014
DOI: 10.1016/j.nuclphysbps.2015.03.006